A perceptual image completion approach based on a hierarchical optimization scheme
نویسندگان
چکیده
This paper aims to introduce a novel efficient approach for high-quality and fast image restoration by combining a greedy strategy and a global optimization strategy based on a pyramidal representation of the image. A coarse version of the input image is first restored by exemplar-based method using a greedy strategy. From the low-resolution inpainted image, higher resolutions are interpolated and refined by a global optimization strategy. Experimental results on natural images demonstrate the effectiveness of the proposed method. Moreover, a comparison with some methods of the state-of-the-art confirms the superiority of the proposed method in terms of image quality and computational time.
منابع مشابه
Visual Pattern Image Coding by a Morphological Approach (RESEARCH NOTE)
This paper presents an improvement of the Visual Pattern image coding (VPIC) scheme presented by Chen and Bovik in [2] and [3]. The patterns in this improved scheme are defined by morphological operations and classified by absolute error minimization. The improved scheme identifies more uniform blocks and reduces the noise effect. Therefore, it improves the compression ratio and image quality i...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملUnsupervised Image Segmentation Using a Hierarchical Clustering Selection Process
In this paper we present an unsupervised algorithm to select the most adequate grouping of regions in an image using a hierarchical clustering scheme. Then, we introduce an optimisation approach for the whole process. The grouping method presented is based on the maximisation of a measure that represents the perceptual decision. The whole strategy takes profit from a hierarchical clustering to ...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal Processing
دوره 103 شماره
صفحات -
تاریخ انتشار 2014